Random triangle in square: geometrical approach
نویسنده
چکیده
We call our approach geometrical as instead of considering 6-fold integral in abstract space we consider random triangle (RT) inside the plane rectangle when all possible cases are explicitly apparent. Area of triangle with vertices p1=(x1,y1), p2=(x2,y2), p3=(x3,y3) is equal to s = 1 2 (x1(y2− y3) + x2 (−y1 + y3) + x3 (y1− y2)). (1) Let points p1, p2, p3 are randomly (with constant differential probability function) distributed over the rectangle with sides A, B. What is the mean area of triangles with vertices p1,p2,p3? Answer is evident: zero, as any given triangle corresponds to 6 cases of full permutation of three points at vertices of the triangle. Mean area of this 6 triangles, as given by (1), is zero. But if we take triangle as geometrical figure and if we consider an area of such a figure as positive value, then we must take absolute value of s in formula (1) and... calculation of relevant integrals become impossible even for Mathematica. So Michael Trott in his recent brilliant paper in Mathematica Journal [1] found 496 different integrals each over subregion with the same sign of s, and then used Mathematica to solve such an enormously difficult task. Needless to say that M.Trott’s stunning skill of using Mathematica is far out of scope of ordinary reader (as me, e.g.), so I’ve spend some three weeks in searching a more simple solution. The result is most easily get by the explicit geometrical approach.
منابع مشابه
Bertrand’s Paradox Revisited: More Lessons about that Ambiguous Word, Random
The Bertrand paradox question is: “Consider a unit-radius circle for which the length of a side of an inscribed equilateral triangle equals 3 . Determine the probability that the length of a ‘random’ chord of a unit-radius circle has length greater than 3 .” Bertrand derived three different ‘correct’ answers, the correctness depending on interpretation of the word, random. Here we employ geomet...
متن کاملThe Exact Solution of an Octagonal Rectangle Triangle Random Tiling
We present a detailed calculation of the recently published exact solution of a random tiling model possessing an eight-fold symmetric phase. The solution is obtained using Bethe Ansatz and provides closed expressions for the entropy and phason elastic constants. Qualitatively, this model has the same features as the square-triangle random tiling model. We use the method of P. Kalugin, who solv...
متن کاملAnsatz solution of a decagonal rectangle triangle random tiling
A random tiling of rectangles and triangles displaying a decagonal phase is solved by Bethe Ansatz. Analogously to the solutions of the dodecagonal square triangle and the octagonal rectangle triangle tiling an exact expression for the maximum of the entropy is found.
متن کاملTHE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G
To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...
متن کاملBethe Ansatz solution of a decagonal rectangle triangle random tiling
A random tiling of rectangles and triangles displaying a decagonal phase is solved by Bethe Ansatz. Analogously to the solutions of the dodecagonal square triangle and the octagonal rectangle triangle tiling an exact expression for the maximum of the entropy is found. PACS numbers: 05.20.-y, 05.50.+q, 04.20.Jb, 61.44.Br Short title: Solution of a decagonal random tiling February 1, 2008 † Elect...
متن کامل